Planar graph

Results: 671



#Item
11Computing the Width of a Point Set in 3-Spa
e Thomas Herrmann Institute for Theoreti
al Computer S
ien
e  Institute for Operations Resear
h

Computing the Width of a Point Set in 3-Spa e Thomas Herrmann Institute for Theoreti al Computer S ien e Institute for Operations Resear h

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-06-20 11:55:11
12The planar slope-number of planar partial 3-trees of bounded degree Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesaˇr and Tomáš Vyskoˇcil Charles University in Prague University of Illin

The planar slope-number of planar partial 3-trees of bounded degree Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesaˇr and Tomáš Vyskoˇcil Charles University in Prague University of Illin

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:45:55
13Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA {

Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA {

Add to Reading List

Source URL: www.cs.uwm.edu

Language: English - Date: 2011-07-31 13:36:56
14Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague  Graph: G = (V , E ), V finite, E ⊆

Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague Graph: G = (V , E ), V finite, E ⊆

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2015-09-15 10:40:14
15On the Strong Chromatic Index of Sparse Graphs Philip DeOrsey1,6 Jennifer Diemunsch2,6 Michael Ferrara2,6,7 2,6 3,6,8

On the Strong Chromatic Index of Sparse Graphs Philip DeOrsey1,6 Jennifer Diemunsch2,6 Michael Ferrara2,6,7 2,6 3,6,8

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2015-07-03 21:55:58
16Lecture 26  Spectral Graph Theory Planar Graphs 2, the Colin de Verdi`ere Number December 4, 2009

Lecture 26 Spectral Graph Theory Planar Graphs 2, the Colin de Verdi`ere Number December 4, 2009

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2012-08-24 09:50:05
17Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell  Computer Engineering and Networks Laboratory

Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:28
18Chi-Han Peng & Peter Wonka / Connectivity Editing for Quad-Dominant Meshes  Additional Materials Figure 17: The two possible outcomes (depending on the pvertex/d-vertex labeling) in the primal domain √ by applying a

Chi-Han Peng & Peter Wonka / Connectivity Editing for Quad-Dominant Meshes Additional Materials Figure 17: The two possible outcomes (depending on the pvertex/d-vertex labeling) in the primal domain √ by applying a

Add to Reading List

Source URL: peterwonka.net

Language: English - Date: 2013-06-17 17:23:15
19Specral Graph Theory and its Applications  September 2, 2004 Lecture 1 Lecturer: Daniel A. Spielman

Specral Graph Theory and its Applications September 2, 2004 Lecture 1 Lecturer: Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2005-06-30 12:02:42
20A brief summary of the work of Fan Chung 1. Extremal graph theory • Universal graphs The general problem of interest is: “What is the smallest graph which contains as subgraphs (or induced subgraphs) all members of a

A brief summary of the work of Fan Chung 1. Extremal graph theory • Universal graphs The general problem of interest is: “What is the smallest graph which contains as subgraphs (or induced subgraphs) all members of a

Add to Reading List

Source URL: www.math.ucsd.edu

Language: English - Date: 2000-06-04 20:41:54